Surface Reconstruction from unorganized 3D Points by an improved Shrink-wrapping Algorithm
نویسندگان
چکیده
منابع مشابه
Surface Reconstruction from Unorganized Points
1. Briefly summarize the paper’s contributions. Does it address a new problem? Does it present a new approach? Does it show new types of results? [AS] This paper presents an algorithm that produces a simplicial surface, approximating a manifold surface M, from an unorganized set of points containing little to no information about M. It presents a new approach to the problem of recovering surf...
متن کاملVariational Volumetric Surface Reconstruction from Unorganized Points
Reconstruction of smooth surfaces from point sets is an important problem in many applications since this sort of data often appear in real-life scenarios. This paper presents method for solving this this problem at interactive rates by means of second order energy minimization obtained by solving △2 = 0 on a discrete scalar field using an iterative multigrid approach. Every step in the reconst...
متن کاملShrink - Wrapped Boundary Face Algorithm for Mesh Reconstruction from Unorganized Points
Bon Ki Koo et al. 235 ABSTRACT⎯A new mesh reconstruction scheme for approximating a surface from a set of unorganized 3D points is proposed. The proposed method, called a shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. SWBF surmounts the genus-0 spherical topology restriction...
متن کاملSurface Reconstruction from Unorganized 3D Point Clouds
Computer-based surfacemodels are indispensable in several fields of science and engineering. For example, the design and manufacturing of vehicles, such as cars and aircrafts, would not be possible without sophisticated CAD and simulation tools predicting the behavior of the product. On the other hand, designers often do not like working on virtual models, though sophisticated tools, like immer...
متن کاملCurve reconstruction from unorganized points
We present an algorithm to approximate a set of unorganized points with a simple curve without self-intersections. The moving least-squares method has a good ability to reduce a point cloud to a thin curve-like shape which is a near-best approximation of the point set. In this paper, an improved moving least-squares technique is suggested using Euclidean minimum spanning tree, region expansion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2007
ISSN: 1598-2831
DOI: 10.3745/kipsta.2007.14-a.3.133